HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving

نویسندگان

  • Cezary Kaliszyk
  • François Chollet
  • Christian Szegedy
چکیده

Large computer-understandable proofs consist of millions of intermediate logical steps. The vast majority of such steps originate from manually selected and manually guided heuristics applied to intermediate goals. So far, machine learning has generally not been used to filter or generate these steps. In this paper, we introduce a new dataset based on Higher-Order Logic (HOL) proofs, for the purpose of developing new machine learning-based theorem-proving strategies. We make this dataset publicly available under the BSD license. We propose various machine learning tasks that can be performed on this dataset, and discuss their significance for theorem proving. We also benchmark a set of simple baseline machine learning models suited for the tasks (including logistic regression, convolutional neural networks and recurrent neural networks). The results of our baseline models show the promise of applying machine learning to HOL theorem proving.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Premise Selection for Theorem Proving by Deep Graph Embedding

We propose a deep learning-based approach to the problem of premise selection: selecting mathematical statements relevant for proving a given conjecture. We represent a higher-order logic formula as a graph that is invariant to variable renaming but still fully preserves syntactic and semantic information. We then embed the graph into a vector via a novel embedding method that preserves the inf...

متن کامل

Holophrasm: a neural Automated Theorem Prover for higher-order logic

I propose a system for Automated Theorem Proving in higher order logic using deep learning and eschewing hand-constructed features. Holophrasm exploits the formalism of the Metamath language and explores partial proof trees using a neural-network-augmented bandit algorithm and a sequence-to-sequence model for action enumeration. The system proves 14% of its test theorems from Metamath’s set.mm ...

متن کامل

Compiling HOL4 to Native Code

We present a framework for extracting and compiling proof tools and theories from a higher order logic theorem prover, so that the theorem prover can be used as a platform for supporting reasoning in other applications. The framework is demonstrated on a small application that uses HOL4 to find proofs of arbitrary first order logic formulas.

متن کامل

New Architectures, Algorithms and Designs That Lead to Implemented Machine Reasoning over Knowledge in Epistemic and Deontic Formats, in the Service of Advanced Wargaming

We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then use Athena as a metalanguage in order to reason about the multi-agent logic an as object language. This facilitates theorem proving in the multi-agent logic in several ways. First, it lets us marshal the highly efficient theore...

متن کامل

CDCL-Based Abstract State Transition System for Coherent Logic

We present a new, CDCL-based approach for automated theorem proving in coherent logic — an expressive semi-decidable fragment of first-order logic that provides potential for obtaining human readable and machine verifiable proofs. The approach is described by means of an abstract state transition system, inspired by existing transition systems for SAT and represents its faithful lifting to cohe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1703.00426  شماره 

صفحات  -

تاریخ انتشار 2017